An ILP Approach to Spatial Clustering

نویسندگان

  • Antonio Varlaro
  • Annalisa Appice
  • Antonietta Lanza
  • Donato Malerba
چکیده

Spatial clustering is a fundamental task in Spatial Data Mining where the goal is to group nearby sites and form clusters of homogeneous regions. Spatial clustering must be driven by the discrete spatial structure of data that expresses the (spatial) relational constraints between separate sites. Only similar sites (transitively) connected in the discrete spatial structure may be clustered together. CORSO is a novel clustering method that resorts to an ILP approach to mine spatial data and exploits the concept of neighborhood to capture relational constraints. Spatial data are expressed in a first-order formalism and similarity among structured objects is computed as degree of matching with respect to a common generalization. Two real-world applications are described.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Recent Improvements on ILP-based Clustering for Broadcast News Speaker Diarization

First we propose a reformulation of the Integer Linear Programming (ILP) clustering method we introduced at Odyssey 2012, for broadcast news Speaker Diarization. We included an overall distance filtering which drastically reduce the complexity of the problems to be solved. Then, we present a clustering approach where the problem is globally considered as a connected graph. The search for Star-g...

متن کامل

A flexible ILP formulation for hierarchical clustering

Hierarchical clustering is a popular approach in a number of fields with many well known algorithms. However, all existing work to our knowledge implements a greedy heuristic algorithm with no explicit objective function. In this work we formalize hierarchical clustering as an integer linear programming (ILP) problem with a natural objective function and the dendrogram properties enforced as li...

متن کامل

ناحیه جواب جدید برای حل مدل برنامه ریزی خطی بازه ای

We consider interval linear programming (ILP) problems in the current paper. Best-worst case (BWC) is one of the methods for solving ILP models. BWC determines the values ​​of the target function, but some of the solutions obtained through BWC may result in an infeasible space. To guarantee that solution is completely feasible (i.e. avoid constraints violation), improved two-step method (ITSM) ...

متن کامل

A New Goal programming approach for cross efficiency evaluation

Cross efficiency evaluation was developed as an extension of DEA. But the traditional DEA models usually have alternative optimal solutions and, as a result, cross efficiency scores may not be unique. It is recommended that without changing the DEA efficiency scores, the secondary goal should be introduced for optimization of the inputs/outputs weights.  Several reports evaluated the perfo...

متن کامل

Coreference Clustering using Column Generation

In this paper we describe a novel way of generating an optimal clustering for coreference resolution. Where usually heuristics are used to generate a document-level clustering, based on the output of local pairwise classifiers, we propose a method that calculates an exact solution. We cast the clustering problem as an Integer Linear Programming (ILP) problem, and solve this by using a column ge...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005